A Note on the Transformation Behaviors Between Truth Tables and Algebraic Normal Forms of Boolean Functions

Let f be a Boolean function in n variables. The Möbius transform and its converse of can describe the transformation behaviors between truth table coefficients monomials algebraic normal form representation f. In this letter, we develop into more generalized form, which also includes known result given by Reed 1954. We hope that our new used design decoding schemes for linear codes cryptanalysis symmetric cryptography. apply to verify basic idea cube attack very simple way, is powerful technique on